New low-density-parity-check decoding approach based on the hard and soft decisions algorithms
نویسندگان
چکیده
<span lang="EN-US">It is proved that hard decision algorithms are more appropriate than a soft for low-density parity-check (LDPC) decoding since they less complex at the level. On other hand, it notable algorithm outperforms one in terms of bit error rate (BER) gap. In order to minimize BER and gap between these two families LDPC codes, new suggested this paper, which based on both normalized min-sum (NMS) modified-weighted bit-flipping (MWBF). The proposed named min sum- modified weighted flipping (NMSMWBF). MWBF executed after NMS algorithm. simulations show our 10-8 over additive white gaussian noise (AWGN) channel by 0.25 dB. Furthermore, NMSMWBF same level difficulty.</span>
منابع مشابه
Soft Bit Decoding of Low Density Parity Check Codes
A novel soft-bit-domain decoding algorithm for low-density parity-check codes is derived as an alternative to belief propagation and min-sum algorithms. A simple approximation analogous to the min-sum approximation is also presented. Simulation results demonstrating the functionality of the algorithm are given both for floating and fixed point representations.
متن کاملIterative reliability-based decoding of low-density parity check codes
In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagatio...
متن کاملNew Iterative Decoding Algorithms for Low-Density Parity-Check (LDPC) Codes
Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their capacity achieving/approaching property. This work studies the iterative decoding also known as message-passing algorithms applied to LDPC codes. Belief propagation (BP) algorithm and its approximations, most notably min-sum (MS), are popular iterative decoding algorithms used for LDPC and turbo codes. The thesis ...
متن کاملLow-density parity-check codes: Design and decoding
In this chapter, we treat code design and decoding for a family of error corWork supported by a CSIRO Telecommunications & Industrial Physics postgraduate scholarship and the Centre for Integrated Dynamics and Control (CIDAC). Work supported in part by Bell Laboratories Australia, Lucent Technologies, as well as the Australian Research Council under Linkage Project Grant LP0211210, and the Cent...
متن کاملIterative Decoding of Low-Density Parity Check Codes (A Survey)
Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check codes. For certain important stochastic channels, this line of work has enabled getting very close to Shannon capacity with algorithms that are extremely effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical and Computer Engineering
سال: 2023
ISSN: ['2088-8708']
DOI: https://doi.org/10.11591/ijece.v13i2.pp1639-1646